Generalized ramsey theory for graphs, x: double stars

نویسندگان

  • Jerrold W. Grossman
  • Frank Harary
  • Maria Klawe
چکیده

The double star S(n, m), where n * m a 0, is the graph cons isting of the union of two stars &I and &n together with a line joining their centers. Its rsmsey number r(S(n, m)) is the least number p such that there is a monochromatic copy of S(n, m) in any 2-coloring of the edges of Kpa It is shown that r(S(n, m)) = max (2n + 1, n + 2m + 2) if n is odd and m G 2; and r(S(n, m)) = max (2n + 2, n + 2m + 2) otherwise, for n ~&z or n 3 3m.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The locating-chromatic number for Halin graphs

Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...

متن کامل

Generalized Ramsey theory and decomposable properties of graphs

In this paper we translate Ramsey-type problems into the language of decomposable hereditary properties of graphs. We prove a distribu-tive law for reducible and decomposable properties of graphs. Using it we establish some values of graph theoretical invariants of decompos-able properties and show their correspondence to generalized Ramsey numbers.

متن کامل

Ramsey and Turán-type problems for non-crossing subgraphs of bipartite geometric graphs

Geometric versions of Ramsey-type and Turán-type problems are studied in a special but natural representation of bipartite graphs and similar questions are asked for general representations. A bipartite geometric graphG(m,n) = [A,B] is simple if the vertex classes A,B of G(m,n) are represented in R2 as A = {(1, 0), (2, 0), . . . , (m, 0)}, B = {(1, 1), (2, 1), . . . , (n, 1)} and the edge ab is...

متن کامل

Generalized Ramsey Theory for Multiple Colors

In this paper, we study the generalized Ramsey number r(G, , . . ., Gk) where the graphs GI , . . ., Gk consist of complete graphs, complete bipartite graphs, paths, and cycles. Our main theorem gives the Ramsey number for the case where G 2 , . . ., G,, are fixed and G, ~_C, or P,, with n sufficiently large . If among G2 , . . ., G k there are both complete graphs and odd cycles, the main theo...

متن کامل

Ramsey and Turán-type problems in bipartite geometric graphs

A = {(1, 0), (2, 0), . . . , (n, 0)}, B = {((1, 1), (2, 1), . . . , (n, 1)} and the edge ab is the line segment joining a ∈ A and b ∈ B in R. This model is essentially the same as the cyclic bipartite graphs and ordered bipartite graphs considered earlier by several authors. Subgraphs — paths, trees, double stars, matchings — are called non-crossing if they do not contain edges with common inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1979